A Note on Determinant of Square Fuzzy Matrix
نویسنده
چکیده
In this article, we would like to study the determinant theory of fuzzy matrices. The purpose of this article is to present a new way of expanding the determinant of fuzzy matrices and thereafter some properties of determinant are considered. Most of the properties are found to be analogus to the properties of determinant of matrices in crisp cases. Index Terms — reference function, membership value, convergence of powers of fuzzy matrices, complement of a fuzzy set.
منابع مشابه
Positive solution of non-square fully Fuzzy linear system of equation in general form using least square method
In this paper, we propose the least-squares method for computing the positive solution of a $mtimes n$ fully fuzzy linear system (FFLS) of equations, where $m > n$, based on Kaffman's arithmetic operations on fuzzy numbers that introduced in [18]. First, we consider all elements of coefficient matrix are non-negative or non-positive. Also, we obtain 1-cut of the fuzzy number vector solution of ...
متن کاملMinimal solution of fuzzy neutrosophic soft matrix
The aim of this article is to study the concept of unique solvability of max-min fuzzy neutrosophic soft matrix equation and strong regularity of fuzzy neutrosophic soft matrices over Fuzzy Neutrosophic Soft Algebra (FNSA). A Fuzzy Neutrosophic Soft Matrix (FNSM) is said to have Strong, Linear Independent (SLI) column (or, in the case of fuzzy neutrosophic soft square matrices, to be strongly r...
متن کاملOn the powers of fuzzy neutrosophic soft matrices
In this paper, The powers of fuzzy neutrosophic soft square matrices (FNSSMs) under the operations $oplus(=max)$ and $otimes(=min)$ are studied. We show that the powers of a given FNSM stabilize if and only if its orbits stabilize for each starting fuzzy neutrosophic soft vector (FNSV) and prove a necessary and sufficient condition for this property using the associated graphs of the FNSM. ...
متن کاملGeneralized matrix functions, determinant and permanent
In this paper, using permutation matrices or symmetric matrices, necessary and sufficient conditions are given for a generalized matrix function to be the determinant or the permanent. We prove that a generalized matrix function is the determinant or the permanent if and only if it preserves the product of symmetric permutation matrices. Also we show that a generalized matrix function is the de...
متن کاملLecture Notes: Determinant of a Square Matrix
j=1 (−1) +j · ai∗j · det(M i∗j). (1) Besides det(A), we may also denote the determinant of A as |A|. Henceforth, if we apply (1) to compute det(A), we say that we expand A by row i∗. It is important to note that the value of det(A) does not depend on the choice of i∗. We omit a proof of this fact, but illustrate it in the following examples. Example 1 (Second-Order Determinants). In general, if...
متن کامل